Centroid Update Approach to K-Means Clustering
نویسندگان
چکیده
منابع مشابه
Scalable Kernel k-Means via Centroid Approximation
Although kernel k-means is central for clustering complex data such as images and texts by implicit feature space embedding, its practicality is limited by the quadratic computational complexity. In this paper, we present a novel technique based on scalable centroid approximation that accelerates kernel k-means down to a sub-quadratic complexity. We prove near-optimality of our algorithm, and e...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملk-means-: A Unified Approach to Clustering and Outlier Detection
We present a unified approach for simultaneously clustering and discovering outliers in data. Our approach is formalized as a generalization of the k-means problem. We prove that the problem is NP-hard and then present a practical polynomial time algorithm, which is guaranteed to converge to a local optimum. Furthermore we extend our approach to all distance measures that can be expressed in th...
متن کاملA Novel Approach to Scene Classification using K-Means Clustering
A challenging problem of computer vision is scene classification. An efficient method for classifying natural scenes from the Oliva – Torralba dataset is proposed. The method is based on K-Means clustering algorithm followed by a novel two phase voting method for classification which is the main contribution of this paper. Two distinct feature sets have been used. The first feature set is used ...
متن کاملA Novel Approach to Scene Classification using K-Means Clustering
A challenging problem of computer vision is scene classification. An efficient method for classifying natural scenes from the Oliva – Torralba dataset is proposed. The method is based on K-Means clustering algorithm followed by a novel two phase voting method for classification which is the main contribution of this paper. Two distinct feature sets have been used. The first feature set is used ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Electrical and Computer Engineering
سال: 2017
ISSN: 1582-7445,1844-7600
DOI: 10.4316/aece.2017.04001